Equilibria in multi-player multi-outcome infinite sequential games
نویسندگان
چکیده
منابع مشابه
Equilibria in multi-player multi-outcome infinite sequential games
We investigate the existence of certain types of equilibria (Nash, ε-Nash, subgame perfect, ε-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental approaches: one requires strong topological restrictions on the games, but produces very strong existence results. The other merely requires some very basic determinacy properties to still o...
متن کاملCorrelated Equilibria in Multi-Player Games
This paper gives a constructive proof for the existence of correlated equilibria in multi-player games and shows how elements of the proof can be used for the computation of correlated equilibria in polynomial time for an important subset of succinct games. None of this work is novel, it merely aims at a more detailed and approachable description of the proof in Papadimitriou’s journal article ...
متن کاملApproximate Nash Equilibria for Multi-player Games
We consider games of complete information with r ≥ 2 players, and study approximate Nash equilibria in the additive and multiplicative sense, where the number of pure strategies of the players is n. We establish a lower bound of r−1 √ lnn−2 ln lnn−ln r ln r on the size of the support of strategy profiles which achieve an ε-approximate equilibrium, for ε < r−1 r in the additive case, and ε < r− ...
متن کاملErgasÐa-Episkìphsh dhmosÐeushc: Computing Equilibria in Multi-player Games
Sthn paroÔsa ergasÐa ja knoume mia episkìphsh thc dhmosÐeushc: Computing Equilibria in Multi-Player Games twn Papadimitriou kai Roughgarden [Ch.05] (ìpwc faÐnetai ki apì ton tÐtlo!). H dhmosÐeush afor kurÐwc correlated equilibria, mia pio 'genik ' morf issoropÐac apì ta Nash equilibria, pou krÔbei mèsa thc èna eÐdoc sunergasÐac metaxÔ twn paikt ̧n (an kai den eÐnai akrib ̧c ètsi, oi paÐktec exa...
متن کاملNash Equilibria for Reachability Objectives in Multi-player Timed Games
We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2021
ISSN: 0890-5401
DOI: 10.1016/j.ic.2020.104557